Branch decomposition heuristics for linear matroids

نویسندگان

  • Jing Ma
  • Susan Margulies
  • Illya V. Hicks
  • Edray Goins
چکیده

This paper presents two new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch decompositions for linear matroids. In the literature, there are already excellent heuristics for graphs, however, no practical branch decomposition methods for general linear matroids have been addressed yet. Introducing a “measure” which compares the “similarity” of elements of a linear matroid, this work reforms the linear matroid into a similarity graph. Then, two different methods, classification method and max-flow method, both basing on the similarity graph are developed into heuristics. Computational results using the classification method and the max-flow method on linear matroid instances are shown respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposition width - a new width parameter for matroids

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if their decomposition is given. Since decompositions of small width for our new notion can be computed in polynomial time for matroids of bounded branch-width r...

متن کامل

Monadic second-order model-checking on decomposable matroids

A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the polynomial time model checking of MSOM on representable matroids of bounded branch-width, by reduction to MSO on trees, much simpler than the one previously known. We deduce results about spectrum of MSOM formulas and enumeration on matroids of bounded branch-width. We ...

متن کامل

Amalgam Width of Matroids

We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing the algorithmic application on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order lo...

متن کامل

Deciding first order logic properties of matroids

Frick and Grohe [J. ACM 48 (2006), 1184–1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we introduce an analogous notion for matroids (locally bounded branch-width) and show the existence of a fixed parameter algorithm for first order logic propertie...

متن کامل

On the Excluded Minors for Matroids of Branch-Width Three

Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple, G. Whittle, On Matroids of Branch-Width Three, submitted 2001] that if M is an excluded minor for matroids of branch-width 3, then M has at most 14 elements. We show that there are exactly 10 such binary matroids M (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Optimization

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2013